Fuzzy attribute logic: syntactic entailment and completeness
نویسندگان
چکیده
Fuzzy attribute implications are particular if-then rules which can be extracted from data tables with fuzzy attributes. We develop fuzzy attribute logic (FAL), its syntax, semantics, and prove a classical as well as Pavelka-style completeness theorem for FAL. Also, we present relationships to completeness of sets of attribute implications w.r.t. data tables. Because of the limited scope of the paper, we omit examples.
منابع مشابه
Rational fuzzy attribute logic
We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka style and depending on the choice of structure of truth degrees, the logic is a decidable fragment of the Rational Pavelka logic (RPL) or the Rational Product...
متن کاملFuzzy logic programming reduced to reasoning with attribute implications
We present a link between two types of logic systems for reasoning with graded if–then rules: the system of fuzzy logic programming (FLP) in sense of Vojtáš and the system of fuzzy attribute logic (FAL) in sense of Belohlavek and Vychodil. We show that each finite theory consisting of formulas of FAL can be represented by a definite program so that the semantic entailment in FAL can be characte...
متن کاملFuzzy Attribute Logic: Attribute Implications, Their Validity, Entailment, and Non-redundant Basis∗
We present results related to if-then rules and extraction of if-then rules from data tables with fuzzy attibutes. We provide basic definitions and results related to validity of if-then rules, semantic entailment, non-redundant bases, automatic generation of non-redundant bases, and relationships to concept lattices over data with fuzzy attributes.
متن کاملAttribute Dependencies for Data with Grades
This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or “fuzzy”, attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact matc...
متن کاملProperties of models of fuzzy attribute implications
This paper deals with closure properties of models of fuzzy attribute implications. Fuzzy attribute implications are particular IF-THEN rules which can be interpreted in data tables with fuzzy attributes and/or ranked data tables over domains with similarity relations. We show that models of any set of fuzzy attribute implications form a fuzzy closure system with hedge. Conversely, we show that...
متن کامل